Symbol-Triple Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over Fq+uFq+u2Fq
نویسندگان
چکیده
Let p be an odd prime, where ϑ and m are positive integers. ψ a nonzero element of the finite field Fq, q=pm, R=Fq+uFq+u2Fq(u3=0). In this paper, we determine completely symbol-triple distances all ψ-constacyclic codes length pϑ over R.
منابع مشابه
Repeated-root constacyclic codes of length slmpn
For any different odd primes ` and p, structure of constacyclic codes of length 2`p over the finite field Fq of characteritic p and their duals is established in term of their generator polynomials. Among other results, the characterization and enumeration of all linear complimentary dual and self-dual constacylic codes of length 2`p are obtained.
متن کاملB-symbol Distance Distribution of Repeated-root Cyclic Codes
Symbol-pair codes, introduced by Cassuto and Blaum [1], have been raised for symbol-pair read channels. This new idea is motivated by the limitations of the reading process in high-density data storage technologies. Yaakobi et al. [8] introduced codes for b-symbol read channels, where the read operation is performed as a consecutive sequence of b > 2 symbols. In this paper, we come up with a me...
متن کاملThe symbol-pair distance distribution of repeated-root cyclic codes over $\mathbb{F}_{p^m}$
Abstract: Symbol-pair codes are proposed to protect against pair errors in symbol-pair read channels. One of the most important task in symbol-pair coding theory is to determine the minimum pair-distance of symbol-pair codes. In this paper, we investigate the symbol-pair distances of cyclic codes of length p over Fpm . The exact symbol-pair distances of all cyclic codes of such length are deter...
متن کاملRepeated-root constacyclic codes of length $2\ell^mp^n$
For any different odd primes l and p, structure of constacyclic codes of length 2lp over a finite field Fq of characteritic p and their duals is established in term of their generator polynomials. Among other results, all linear complimentary dual and self-dual constacyclic codes of length 2lp over Fq are obtained.
متن کاملTwo generalizations on the minimum Hamming distance of repeated-root constacyclic codes
We study constacyclic codes, of length np and 2np, that are generated by the polynomials (x+γ) and (x−ξ)(x+ξ) respectively, where x+γ, x−ξ and x+ξ are irreducible over the alphabet Fpa . We generalize the results of [5], [6] and [7] by computing the minimum Hamming distance of these codes. As a particular case, we determine the minimum Hamming distance of cyclic and negacyclic codes, of length ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10142496